/*
 * Copyright (c) 2017 Kyoung Jae Seo <manettus@icloud.com>
 *
 * Permission to use, copy, modify, and distribute this software for any
 * purpose with or without fee is hereby granted, provided that the above
 * copyright notice and this permission notice appear in all copies.
 *
 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 */

#include <stdio.h>
#include <limits.h>
#include <stdint.h>

#define BIT(a, i) (a&((uint32_t)1 << (i)))
#define FLIP(a, i) (a ^= ((uint32_t)1 << (i)))

void
sweep(uint32_t state, uint32_t limit_bit, uint32_t *count)
{
	uint32_t i;

	for(i = 0; i < limit_bit; i++)
	{
		if(BIT(state, i))
			if(!BIT(state, i + 1))
			{
				FLIP(state, i);
				FLIP(state, i + 1);
				(*count)++;
				sweep(state, i, count);
			}
	} 

	return;
}

